منابع مشابه
Formalizing Homogeneous Language Embeddings
The cost of implementing syntactically distinct Domain Specific Languages (DSLs) can be reduced by homogeneously embedding them in a host language in cooperation with its compiler. Current homogeneous embedding approaches either restrict the embedding of multiple DSLs in order to provide safety guarantees, or allow multiple DSLs to be embedded but force the user to deal with the interoperabilit...
متن کاملAffine Embeddings of Homogeneous Spaces
Let G be a reductive algebraic group and H a closed subgroup of G. An affine embedding of the homogeneous space G/H is an affine G-variety with an open G-orbit isomorphic to G/H . The homogeneous space G/H admits an affine embedding if and only if G/H is a quasi-affine algebraic variety. We start with some basic properties of affine embeddings and consider the cases, where the theory is well-de...
متن کاملFractional Embeddings and Stochastic Time
As a model problem for the study of chaotic Hamiltonian systems, we look for the effects of a long-tail distribution of recurrence times on a fixed Hamiltonian dynamics. We follow Stanislavsky’s approach of Hamiltonian formalism for fractional systems. We prove that his formalism can be retrieved from the fractional embedding theory. We deduce that the fractional Hamiltonian systems of Stanisla...
متن کاملEdge homogeneous embeddings of cycles in graphs
Let n > m 2:: 4 be positive integers. The edge framing number efr( Cm, Cn) of Cm and Cn is defined as the minimum size of a graph every edge of which belongs to an induced Cm and an induced Cn. We show that efr(Cm,Cn) = n+4 ifn = 2m-4 and m 2:: 5, efr(Cm,Cn) = n+5 if n = 2m-6 and m ~ 7 and efr(Cm1 Cn) = n+6 if n = 2m-8 (m ~ 10) or m = n -1 (where n ~ 5 and n ¢ {6,S}) or m = n 2 (n = 6 or n 2:: ...
متن کاملHomogeneous Embeddings of Cycles in Graphs
If G and H are vertex-transitive graphs, then the framing number fr(G,H) of G and H is defined as the minimum order of a graph every vertex of which belongs to an induced G and an induced H. This paper investigates fr(Cm, Cn) for m < n. We show first that fr(Cm, Cn) ≥ n+2 and determine when equality occurs. Thereafter we establish general lower and upper bounds which show that fr(Cm, Cn) is app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 2008
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.2963497